A Case Study on Grammatical-Based Representation for Regular Expression Evolution
نویسندگان
چکیده
Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and flexible notation to define and retrieve patterns from text, the syntax and the grammatical rules of these regex notations are not easy to use, and even to understand. Any regex can be represented as a Deterministic or Non-Deterministic Finite Automata; so it is possible to design a representation to automatically build a regex, and a optimization algorithm able to find the best regex in terms of complexity. This paper introduces both, a graph-based representation for regex, and a particular heuristic-based evolutionary computing algorithm based on grammatical features from this language in a particular data extraction problem.
منابع مشابه
Planned Focus-on-form Instruction in Task-based Language Teaching: The case of EFL learners’ oral grammatical accuracy performance
This study investigated the effects of planned focus-on-form instruction (pFFI) on developing oral grammatical accuracy in Iranian English EFL learners. To this end, 60 lower-intermediate EFL learners studying English in a private English language institute in Tehran, Iran, were randomly assigned to two classes. Both classes received a task-based instruction on grammatical points elicited in or...
متن کاملGenetic Programming with Linear Representation: a Survey
Genetic Programming (GP) is an automated method for creating computer programs starting from a high-level description of the problem to be solved. Many variants of GP have been proposed in the recent years. In this paper we are reviewing the main GP variants with linear representation. Namely, Linear Genetic Programming, Gene Expression Programming, Multi Expression Programming, Grammatical Evo...
متن کاملTHE LEFT REGULAR REPRESENTATION OF A COMMUTATIVE SEPARATIVE SEMIGROUP
In this paper, a commutative semigroup will be written as a disjoint union of its cancellative subsemigroups. Based on this fact we will define the left regular representation of a commutative separative semigroup and show that this representation is faithful. Finally concrete examples of commutative separative semigroups, their decompositions and their left regular representations are given.
متن کاملFrom Grammars to Parameters: Automatic Iterated Greedy Design for the Permutation Flow-Shop Problem with Weighted Tardiness
Recent advances in automatic algorithm configuration have made it possible to configure very flexible algorithmic frameworks in order to fine-tune them for particular problems. This is often done by the use of automatic methods to set the values of algorithm parameters. A rather different approach uses grammatical evolution, where the possible algorithms are implicitly defined by a context-free...
متن کاملLocal gradient pattern - A novel feature representation for facial expression recognition
Many researchers adopt Local Binary Pattern for pattern analysis. However, the long histogram created by Local Binary Pattern is not suitable for large-scale facial database. This paper presents a simple facial pattern descriptor for facial expression recognition. Local pattern is computed based on local gradient flow from one side to another side through the center pixel in a 3x3 pixels region...
متن کامل